Decompositions of saturated models of stable theories
نویسنده
چکیده
We characterize the stable theories T for which the saturated models of T admit decompositions. In particular, we show that countable, shallow, stable theories with NDOP have this property. Partially supported by NSF Grants DMS 0071746 and DMS 0300080. Partially supported by U.S.-Israel Binational Science Foundation Grant no. 2002323 and Israel Science Foundation Grant no. 242/03. Publication no. 851. MSC 2000 classification 03C45, 03C50. Both authors are extremely grateful to the anonymous referee for spotting several errors and vastly improving the clarity of the exposition.
منابع مشابه
Constructing Strongly Equivalent Nonisomorphic Models for Unsuperstable Theories, Part C
In this paper we prove a strong nonstructure theorem for κ(T )-saturated models of a stable theory T with dop. This paper continues the work started in [HT].
متن کاملScaling and Fractal Concepts in Saturated Hydraulic Conductivity: Comparison of Some Models
Measurement of soil saturated hydraulic conductivity, Ks, is normally affected by flow patterns such as macro pore; however, most current techniques do not differentiate flow types, causing major problems in describing water and chemical flows within the soil matrix. This study compares eight models for scaling Ks and predicted matrix and macro pore Ks, using a database composed of 50 datasets...
متن کامل|T|+-resplendent models and the Lascar group
Lascar in [4] introduced the group Autf(N/A) of strong automorphisms over A, a normal subgroup of the group Aut(N/A) of all automorphisms overA of a modelN containingA. The quotient Aut(N/A)/Autf(N/A) is independent of the choice of N (for a big saturated model N and a small subset A ⊆ N ) and it is now called the Lascar group over A. Lascar showed in [4] that in the case of a very large class ...
متن کاملPure Computable Model Theory
2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. Introduction History Notation and basic definitions Decidable theories, and computable and decidable models Effective completeness theorem Model completeness and decidability Omitting types and decidability Decidable prime models Computable saturated models and computably saturated models Decidable homogeneous models Vaught's theorem computabl...
متن کاملUnstable First-order Theories
In this paper, we examine the divide between stable and unstable first-order theories in model theory. We begin by defining a stable theory and proving Shelah’s theorem, which reduces the question of stability to a problem of examining a single formula. Afterwards, we will provide some applications of the stability/instability divide to other model-theoretic questions, such as the question of c...
متن کامل